Analysis of the Worst Case Space Complexity of a PR Quadtree
نویسندگان
چکیده
We demonstrate that a resolution-r PR quadtree contaihing II points has, in the worst case, at most 8&r [log,(rt/2)]) + 8n/3 l/3 nodes. This captures the fact that as n tends towards 4’, the number of nodes in a PR quadtree quickly approaches O(n). This is a more precise estimation of the worst case space requirement of a PR quadtree then has been attempted before.
منابع مشابه
Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملDynamic smooth compressed quadtrees (Fullversion)
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First, we show that quadtrees as a space-division data structure can be made smooth and dynamic subject to split and merge operations on the quadtree cells. Second, we show that quadtrees used to store a set of points in R c...
متن کاملQuadtrees - Hierarchical Grids
Let P be a planar map. To be more concrete, let P be a partition of the unit square into triangles (i.e., a mesh). Since any simple polygon can be triangulated, P can represent any planar map, and its partition of the unit square into different regions, with different properties. For the sake of simplicity, assume that every vertex in P shares at most, say, nine triangles. Let us assume that we...
متن کاملA limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the complexity, measured as the number of nodes Cn(ξ) to visit in order to report the items ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 49 شماره
صفحات -
تاریخ انتشار 1994